POLYNOMIAL ALGORITHMS FOR COMPUTING THE SMITH AND HERMITE NORMAL FORMS OF AN INTEGER MATRIXRAVINDRAM KANNAN; ACHIM BACHEM.1979; S.I.A.M. J. COMPUTG; USA; DA. 1979; VOL. 8; NO 4; PP. 499-507; BIBL. 17 REF.Article

APPROXIMATION DE QUELQUES CLASSES DU CALCUL CLASSIQUE DES PREDICATS PAR DES CLASSES RESOLUBLES. INORGELA S.1980; LITOV. MAT. SBOR.; SUN; DA. 1980; VOL. 20; NO 1; PP. 135-143; ABS. LIT/ENG; BIBL. 6 REF.Article

NORMAL FORMS FOR HAMILTONIAN SYSTEMS.MEYER KR.1974; CELEST. MECH.; NETHERL.; DA. 1974; VOL. 9; NO 4; PP. 517-522; BIBL. 4 REF.Article

THE STRUCTURE OF INTEGER PROGRAMS UNDER THE HERMITIAN NORMAL FORM.BOWMAN VJ.1974; OPER. RES.; U.S.A.; DA. 1974; VOL. 22; NO 5; PP. 1067-1080; BIBL. 10 REF.Article

MINIMISATION DES SYSTEMES DE FONCTIONS BOOLEENNES DANS LA CLASSE DES FORMES NORMALES DISJONCTIVESMARKOVSKIJ AV.1972; IN: ABSTR. STRUKT. TEOR. RELEJNYKH USTROJSTV; MOSKVA; NAUKA; DA. 1972; PP. 167-181; BIBL. 9 REF.Book

EINE REPRAESENTATIVE AUSWAHL VON KNOTENMATRIZEN ZU KLASSEN ISOMORPHER GRAPHEN = UNE SELECTION REPRESENTATIVE DES MATRICES DECRIVANT DES CLASSES DE GRAPHES ISOMORPHESREUSS WJ.1982; COMPUTING; ISSN 0010-485X; AUT; DA. 1982; VOL. 28; NO 3; PP. 247-255; ABS. ENG; BIBL. 4 REF.Article

EIN VORSCHLAG FUER DIE VERWENDUNG SYNTAX-ORIENTIERTER METHODEN IN HOEHEREN PROGRAMMIERSPRACHEN. = UNE PROPOSITION POUR L'USAGE DE METHODES ORIENTEES VERS LA SYNTAXE DANS LES LANGAGES DE PROGRAMMATIONMAURER H; STUCKY W.1976; ANGEW. INFORMAT.; DTSCH.; DA. 1976; NO 5; PP. 189-195; ABS. ANGL.; BIBL. 4 REF.Article

SUR LA REALISATION DES FORMES NORMALES DISJONCTIVES DE FONCTIONS BOOLEENNES SUR UNE AIRE MINIMALE DANS UN MILIEU DE CALCULACHASOVA SM.sdVYCHISLIT. SIT.; SIST.; (1971); NO 47; PP. 41-44; BIBL. 5 REF.Serial Issue

ALGORITHMS FOR FINDING CHOMSKY AND GREIBACH NORMAL FORMS FOR A FUZZY CONTEXT-FREE GRAMMAR USING AN ALGEBRAIC APPROACHLEE ET.1983; KYBERNETES; ISSN 0368-492X; GBR; DA. 1983; VOL. 12; NO 2; PP. 125-134; BIBL. 16 REF.Article

COMPLETENESS OF CONTEXT-FREE GRAMMAR FORMSMAURER HA; SALOMAA A; WOOD D et al.1981; J. COMPUT. SYST. SCI.; ISSN 0022-0000; USA; DA. 1981; VOL. 23; NO 1; PP. 1-10; BIBL. 14 REF.Article

DEMONSTRATION ELEMENTAIRE ET APPLICATIONS D'UN THEOREME DE F. TAKENSSADOVSKIJ AP.1980; DIFFER. URAVN. (MINSK, 1965); ISSN 0374-0641; BYS; DA. 1980; VOL. 16; NO 12; PP. 2284-2287; BIBL. 11 REF.Article

COMPLEXITY OF PARTIAL SATISFACTIONLIEBERHERR K; SPECKER E.1979; ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE. 20/1979/SAN JUAN P.R.; USA; NEW YORK: INSTITUTE OF ELECTRICAL AND ELECTRONICS ENGINEERS; DA. 1979; PP. 132-139; BIBL. 12 REF.Conference Paper

FROM LEFT-REGULAR TO GREIBACH NORMAL FORM GRAMMARSNIJHOLT A.1979; INFORM. PROCESSG LETTERS; NLD; DA. 1979; VOL. 9; NO 1; PP. 51-55; BIBL. 14 REF.Article

A MULTIVARIABLE NORMAL-FORM FOR MODEL REDUCTION OF DISCRETE-TIME SYSTEMSBADREDDIN E; MANSOUR M.1983; SYSTEMS AND CONTROL LETTERS; ISSN 509167; NLD; DA. 1983; VOL. 2; NO 5; PP. 271-285; BIBL. 11 REF.Article

A SIMPLE GUIDE TO FIVE NORMAL FORMS IN RELATIONAL DATABASE THEORYKENT W.1983; COMMUNICATIONS OF THE A.C.M.; ISSN 0001-0782; USA; DA. 1983; VOL. 26; NO 2; PP. 120-125; BIBL. 8 REF.Article

RELATIONS BINAIRES COORDONNEES DANS L'ESPACE DES CRITERES. IIVINOGRADSKAYA TM; RUBCHINSKIJ AA.1981; AVTOM. TELEMEH.; ISSN 0005-2310; SUN; DA. 1981; NO 4; PP. 147-155; ABS. ENG; BIBL. 3 REF.Article

A REMARK ON NORMAL FORMS OF MATRICESDLAB V; RINGEL CM.1980; LINEAR ALGEBRA APPL.; USA; DA. 1980-04; VOL. 30; PP. 109-114; BIBL. 5 REF.Article

THE NONEXISTENCE OF SOME COVERING CONTEXT-FREE GRAMMARSUKKONEN E.1979; INFORM. PROCESSG LETTERS; NLD; DA. 1979; VOL. 8; NO 4; PP. 187-192; BIBL. 6 REF.Article

CALCULS FINIS ET INFINIS SUR LES TERMES COMBINATOIRESCANAL R; VIGNOLLE J.1979; LAMBDA CALCUL ET SEMANTIQUE FORMELLE DES LANGAGES DE PROGRAMMATION. ECOLE DE PRINTEMPS D'INFORMATIQUE THEORIQUE. 6/1978/LA CHATRE; FRA; PARIS: LABORATOIRE D'INFORMATIQUE THEORIQUE ET PROGRAMMATION/PARIS: ECOLE NATIONALE SUPERIEURE DE TECHNIQUES AVANCEES; DA. 1979; PP. 109-130; BIBL. 3 P.Conference Paper

JEUX A N JOUEURS: FORME DEVELOPPEE ET FORME NORMALEPATRAT C.1972; CAH. BUR. UNIV. RECH. OPERAT.; PARIS; IMPR. LOUIS-JEAN; DA. 1972; NO 17; PP. 1-85; BIBL. 1 P. 1/2; (THESE DOCT. 3EME CYCLE, SPEC. MATH. STAT., MENTION STAT. MATH.; PARIS; 1970)Thesis

A SUPERNORMAL-FORM THEOREM FOR CONTEXT-FREE GRAMMARSMAURER HH; SALOMAA A; WOOD D et al.1983; JOURNAL OF THE ASSOCIATION FOR COMPUTING MACHINERY; ISSN 0004-5411; USA; DA. 1983; VOL. 30; NO 1; PP. 95-102; BIBL. 12 REF.Article

INFLUENCE DE LA DEPENDANCE FONCTIONNELLE DES ENSEMBLES DE CODES DANS L'OPTIMISATION DE LA STRUCTURE LOGIQUE A DEUX NIVEAUX D'UN AUTOMATELEMBERSKIJ IG.1980; AVTOMAT. VYCHISLIT. TEKH.; SUN; DA. 1980; NO 4; PP. 42-49; BIBL. 1 REF.Article

LES DIFFERENTES NOTIONS DE MINIMALITE DES FORMES NORMALES DISJONCTIVESVEBER K.1979; PROBL. KIBERN.; SUN; DA. 1979; NO 36; PP. 129-158; BIBL. 10 REF.Article

STRUCTURE PRESERVING ELIMINATION OF NULL PRODUCTIONS FROM CONTEXT-FREE GRAMMARSUKKONEN E.1982; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1982; VOL. 17; NO 1; PP. 43-54; BIBL. 10 REF.Article

SYNCHRONIZED EOL FORMS UNDER UNIFORM INTERPRETATIONMAURER HA; SALOMAA A; WOOD D et al.1981; R.A.I.R.O., INFORM. THEOR.; ISSN 0399-0540; FRA; DA. 1981; VOL. 15; NO 4; PP. 337-353; ABS. FRE; BIBL. 11 REF.Article